package Text13;
import java.util.*;
//public class Main {
//    //如果 N = p1^c1 * p2^c2 * ... *pk^ck
//    //约数个数： (c1 + 1) * (c2 + 1) * ... * (ck + 1)
public class Main {
    static int mod = (int) 1e9 + 7;
    public static void main(String[] args) {
        Map<Integer, Integer> map = new HashMap<>(); //创建一个哈希表
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        while(n-->0){
            int x=scanner.nextInt();
            for (int i = 2; i <=x/i ; i++) {
                int cnt=0;
                while(x%i==0){
                    x/=i;
                    cnt++;
                }
                map.put(i,map.getOrDefault(i,0)+cnt);
            }
            if(x>1){
                map.put(x,map.getOrDefault(x,0)+1);
            }
        }
        long res=1;
        for (int val:map.values()){
            res=res*(val+1)%mod;
        }
        System.out.println(res);
    }
}
